Diagonal Majorization Algorithm: Properties and Efficiency
نویسندگان
چکیده
In this paper, the diagonal majorization algorithm (DMA) has been investigated. The research focuses on the possibilities to increase the efficiency of the algorithm by disclosing its properties. The diagonal majorization algorithm is oriented at the multidimensional data visualization. The experiments have proved that, when visualizing large data set with DMA, it is possible to save the computing time taking into account several factors: the strategy of numbering of multidimensional vectors in the analysed data set and the neighbourhood order parameter.
منابع مشابه
Block Diagonal Majorization on $C_{0}$
Let $mathbf{c}_0$ be the real vector space of all real sequences which converge to zero. For every $x,yin mathbf{c}_0$, it is said that $y$ is block diagonal majorized by $x$ (written $yprec_b x$) if there exists a block diagonal row stochastic matrix $R$ such that $y=Rx$. In this paper we find the possible structure of linear functions $T:mathbf{c}_0rightarrow mathbf{c}_0$ preserving $prec_b$.
متن کاملConstrained Stress Majorization Using Diagonally Scaled Gradient Projection
Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly improve the speed and convergence properties of the constrained stress-majorization technique for graph layout by employing a diagonal scaling of the stress function. Diagonal scaling requires the active-set quadratic programming ...
متن کاملInequalities on the singular values ofan o - diagonal block of a Hermitian matrix
A majorization relating the singular values of an oo-diagonal block of a Hermitian matrix and its eigenvalues is obtained. This basic majorization inequality implies various new and existing results.
متن کاملStress Majorization with Orthogonal Ordering Constraints
The adoption of the stress-majorization method frommulti-dimensional scaling into graph layout has provided an improved mathematical basis and better convergence properties for so-called “force-directed placement” techniques. In this paper we give an algorithm for augmenting such stress-majorization techniques with orthogonal ordering constraints and we demonstrate several graphdrawing applicat...
متن کاملMajorization in Quantum Adiabatic Algorithms
We study the Majorization arrow in a big class of quantum adiabatic algorithms. In a quantum adiabatic algorithm, the ground state of the Hamiltonian is a guide state around which the actual state evolves. We prove that for any algorithm of this class, step-by-step majorization of the guide state holds perfectly. We also show that step-by-step majorization of the actual state appears if the run...
متن کامل